On the constant domains principle and its weakened versions in the Kripke sheaf semantics

نویسنده

  • Dmitry P. Skvortsov
چکیده

1 We consider the semantics of predicate Kripke frames with equality (called I-frames, for short), which is equivalent to the semantics of Kripke sheaves (see [3]). Namely, a (predicate) Kripke frame is a pairM = (W,U) formed by a posetW with the least element 0W and a domain map U defined on W such that U(u)⊆U(v) for u≤v. An I-frame is a triple M = (W,U, I), in which (W,U) is a Kripke frame and I is a family of equivalence relations Iu on U(u) for u∈W such that Iu⊆Iv for u≤v. A valuation u A (for u∈W and formulas A with parameters replaced by elements of U(u)) satisfies the monotonicity: u ≤ v, u A ⇒ v A and the usual inductive clauses for connectives and quantifiers, e.g. u (B → C) ⇔ ∀v≥u [(v B)⇒ (v C)], u ∀xB(x) ⇔ ∀v≥u∀c∈U(v) [v B(c)], etc. (for the case with equality, a=b is interpreted by aIub in an I-frame and by a=b in a usual Kripke frame, for a, b∈U(u) ). For an I-frame we admit only the valuations preserving Iu (on every U(u), u∈W ), i.e., ∧

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Destructive Modal Resolution

We present non-clausal resolution systems for propositional modal logics whose Kripke models do not involve symmetry, and for first order versions whose Kripke models do not involve constant domains. We give systems for K, T , K4 and S4; other logics are also possible. Our systems do not require preliminary reduction to a normal form and, in the first order case, intermingle resolution steps wi...

متن کامل

Linear Kripke frames and Gödel logics

We investigate the relation between intermediate predicate logics based on countable linear Kripke frames with constant domains and Gödel logics. We show that for any such Kripke frame there is a Gödel logic which coincides with the logic defined by this Kripke frame on constant domains and vice versa. This allows us to transfer several recent results on Gödel logics to logics based on countabl...

متن کامل

Topos Semantics for Higher-Order Modal Logic

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos E . In contrast to the wellknown interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the subobject classifier ΩE , but rather by a suitable complete Heyting algebra H . The canonical map relating H and ΩE both serves to interpret equality and provides a modal...

متن کامل

Fuzzy Acts over Fuzzy Semigroups and Sheaves

lthough fuzzy set theory and  sheaf theory have been developed and studied independently,  Ulrich Hohle shows that a large part of fuzzy set  theory  is in fact a subfield of sheaf theory. Many authors have studied mathematical structures, in particular, algebraic structures, in both  categories of these generalized (multi)sets. Using Hohle's idea, we show that for a (universal) algebra $A$, th...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013